The maximum dimensional fault-free subcube allocatable in faulty hypercube
نویسندگان
چکیده
Abstrust The maximum dimensional subcube located in faulty hypercubes is studied in this paper. Most parallel algorithms can be formulated with the dimension n of the hypercube being a parameter of the algorithm. The reconfiguration problem in a hypercube reduces to finding the maximum dimensional fault-free subcube in the hypercube, that is, helps in achieving graceful and the most effective degradation of the system. Thai paper presents the maximum, number of faults on an ncube on which there always exists at least one fault-free (n 2)-subcube. key words: Hypercube, Fault Tolerance, Allocation, The Maximum Dimemional Fault-Free Subcube
منابع مشابه
Subcube Fault Tolerance in Hypercube Multiprocessors
In this paper, we study the problem of constructing subcubes in faulty hypercubes. First a divide-and-conquer technique is used to form the set of disjoint subcubes in the faulty hypercube. The concept of irregular subcubes is then introduced to take advantage of advanced switching techniques, such as wormhole routing, to increase the sizes of the available subcubes. We present a subcube partit...
متن کاملOptimal Subcube Fault Tolerance in a Circuit-Switched Hypercube
In this papel; by utilizing the circuit-switched communication modules of the hypercube nodes, we present a scheme where a (d 1)-dimensional subcube is allocated in afaulty d-dimensional hyperc,ube in the presence of up to 2(“-]) faulty nodes. The scheme is then extended to allocate a (d 1)-dimensional subcube in the presence of a combination of faulty node,s and faulty links. Theoretical and s...
متن کاملFault - Tolerant Sorting Algorithm on
In this paper, algorithmic fault-tolerant techniques are introduced for sorting algorithms on n-dimensional hypercube multicomputers. We propose a fault-tolerant sorting algorithm that can tolerate up n 1 faulty processors. First, we indicate that the bitonic sorting algorithm can perform sorting operations correctly on the hypercubes with one faulty processor. In order to tolerate up r n 1 fau...
متن کاملA Boolean Expression-Based Approach for Maximum Incomplete Subcube Identification in Faulty Hypercubes
An incomplete hypercube possesses virtually every advantage of complete hypercubes, including simple deadlock-free routing, a small diameter, bounded link traffic density, a good support of parallel algorithms, and so on. It is natural to reconfigure a faulty hypercube into a maximum incomplete cube so as to lower potential performance degradation, because a hypercube so reconfigured often resu...
متن کاملFault-Tolerant Sorting Algorithm on Hypercube Multicomputers
In this paper, algorithmic fault-tolerant techniques are introduced for sorting algorithms on n-dimensional hypercube multi-computers. We propose a fault-tolerant sorting algorithm that can tolerate up to n-1 faulty processors. Fit, we indicate that the bitouic sorting algorithm cau perform sorting operations correctly on hypercubes with one faulty processor. In order to tolerate up to rsn-1 fa...
متن کامل